Linear programming based algorithms for preemptive and non-preemptive RCPSP
نویسندگان
چکیده
منابع مشابه
Linear programming based algorithms for preemptive and non-preemptive RCPSP
In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable is associated to a subset of independent activities (antichains). The properties of the model are first investigated. In particular, conditions are given that allow a solution of the linear program to be a feasible sched...
متن کاملExact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...
متن کاملPreemptive and Non-Preemptive Generalized Min Sum Set Cover
In the (non-preemptive) Generalized Min Sum Set Cover Problem, we are given n ground elements and a collection of sets S = {S1, S2, ..., Sm} where each set Si ∈ 2 has a positive requirement κ(Si) that has to be fulfilled. We would like to order all elements to minimize the total (weighted) cover time of all sets. The cover time of a set Si is defined as the first index j in the ordering such th...
متن کاملA Constraint Programming Approach for Non-preemptive Evacuation Scheduling
Large-scale controlled evacuations require emergency services to select evacuation routes, decide departure times, and mobilize resources to issue orders, all under strict time constraints. Existing algorithms almost always allow for preemptive evacuation schedules, which are less desirable in practice. This paper proposes, for the first time, a constraint-based scheduling model that optimizes ...
متن کاملImproved Approximation Algorithms for the Non-preemptive Speed-scaling Problem
We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is sα per time unit, where α > 1. Our goal is to find a schedule respecting the release dates and the deadlines o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.09.052